On Locating Chromatic Number of Cubic Graph with Tree Cycle, Cn,2n,n, for n=3,4,5

Let G = (V(G), E(G)) be a connected graph and is coloring of G. Π {C1, C2, ...,Ck}, where Ci the partition vertex in which colored i with 1 ≥ k. The representation v for called color code, denoted CΠ(v) ordered pair k-element namely, (d(v, C1), d(v, C2), ..., Ck)), Ci)= mind{d(v, x)|xεCi} If every have different c locating coloring. minimum number colors used chromatic locating, notated by XL(G). In this paper, we will determine cubic Cn,2n,n, n=3,4,5.